An Analysis of BitTorrent’s Two Kademlia-Based DHTs
نویسندگان
چکیده
Despite interest in structured peer-to-peer overlays and their scalability to millions of nodes, few, if any, overlays operate at that scale. This paper considers the distributed hash table extensions supported by modern BitTorrent clients, which implement a Kademlia-style structured overlay network among millions of BitTorrent users. As there are two disjoint Kademlia-based DHTs in use, we collected two weeks of traces from each DHT. We examine churn, reachability, latency, and liveness of nodes in these overlays, and identify a variety of problems, such as median lookup times of over a minute. We show that Kademlia’s choice of iterative routing and its lack of a preferential refresh of its local neighborhood cause correctness problems and poor performance. We also identify implementation bugs, design issues, and security concerns that limit the effectiveness of these DHTs and we offer possible solutions for their improvement.
منابع مشابه
A performance evaluation of the Kad-protocol
Most efficient peer-to-peer protocols deploy structured overlay networks based on Distributed Hash Tables (DHTs). These have been extensively studied through theoretical simulations and analysis over the last few years. Recently, the popular eMule and aMule file-sharing applications incorporate a widelydeployed Kademlia-based DHT, called Kad. The Kad-network with over a million simultaneous use...
متن کاملMitigating Routing Attacks with Local Trust in DHTs
Distributed Hash Tables (DHTs) have been used as a common building block in many distributed applications, including Peer-to-Peer (P2P), Cloud and Grid Computing. However, there are still important security vulnerabilities that hinder their adoption in today’s large-scale computing platforms. For instance, routing vulnerabilities have been a subject of intensive research but existing solutions ...
متن کاملXOROS: A mutable Distributed Hash Table
Data redundancy in DHTs is commonly accomplished through automatic replication of values to a set of close participating nodes. Such copies, once written, should not be modified, as there is no inherent DHT function that can operate on a dynamic set of mutable replicas. In this paper, we present XOROS — a system based on the Kademlia routing scheme, that addresses the problem by implementing a ...
متن کاملLoad Reduction in the KAD Peer-to-Peer System
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have been implemented in real systems and deployed on a large scale. One exception is kad, a DHT based on Kademlia, which is part of eDonkey, a peer-topeer file sharing system with several million simultaneous users. In thi...
متن کامل8. Selected DHT Algorithms
Several different approaches to realizing the basic principles of DHTs have emerged over the last few years. Although they rely on the same fundamental idea, there is a large diversity of methods for both organizing the identifier space and performing routing. The particular properties of each approach can thus be exploited by specific application scenarios and requirements. This overview focus...
متن کامل